Flaw Selection Strategies for Partial-Order Planning
نویسندگان
چکیده
منابع مشابه
Flaw Selection Strategies for Partial-Order Planning
Several recent studies have compared the relative e ciency of alternative aw selection strategies for partial-order causal link (POCL) planning. We review this literature, and present new experimental results that generalize the earlier work and explain some of the discrepancies in it. In particular, we describe the Least-Cost Flaw Repair (LCFR) strategy developed and analyzed by Joslin and Pol...
متن کاملFlaw Selection Strategies for Value-Directed Planning
A central issue faced by partial-order, cansal-link (POCL) planning systems is how to select which flaw to resolve when generating the refinements of a partial plan. Domain-independent flaw selection strategies have been discussed extensively in the recent literature (Peot ~ Smith 1993; Joslin & Pollack 1994; Schubert & Gerevini 1995). The PYRRHUS planning system is a decision-theoretic extensi...
متن کاملLeast-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning
We describe the least-cost flaw repair (LCFR) strategy for performing flaw selection during partial-order causal link (POCL) planning. LCFR can be seen as a generalization of Peot and Smith’s “Delay Unforced Threats” (DUnf) strategy (Peot & Smith 1993); where DUnf treats threats differently from open conditions, LCFR has a uniform mechanism for handling all flaws. We provide experimental result...
متن کاملSearch Strategies for Partial-Order Causal-Link Planning with Preferences
This paper studies how to solve classical planning problems with preferences by means of a partial-order causal-link (POCL) planning algorithm. Preferences are given by soft goals – optional goals which increase a plan’s benefit if satisfied at the end of a plan. Thus, we aim at finding a plan with the best net-benefit, which is the difference of the achieved preferences’ benefit minus the cost...
متن کاملLeast - Cost Flaw Repair : A Plan Re nement Strategy for Partial - Order Planning
We describe the least-cost aw repair (LCFR) strategy for performing aw selection during partial-order causal link (POCL) planning. LCFR can be seen as a generalization of Peot and Smith's \Delay Unforced Threats" (DUnf) strategy (Peot & Smith 1993); where DUnf treats threats di erently from open conditions, LCFR has a uniform mechanism for handling all aws. We provide experimental results that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1997
ISSN: 1076-9757
DOI: 10.1613/jair.393